0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.35	% Computer   : n020.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 14:32:21 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.35	% Number of cores: 8
0.13/0.36	% Python version: Python 3.6.8
0.13/0.36	# Version: 2.6rc1-ho
0.13/0.37	# No SInE strategy applied
0.13/0.37	# Trying AutoSched0 for 59 seconds
0.21/0.57	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.21/0.57	# and selection function SelectMaxLComplexAvoidPosPred.
0.21/0.57	#
0.21/0.57	# Preprocessing time       : 0.065 s
0.21/0.57	
0.21/0.57	# Proof found!
0.21/0.57	# SZS status Theorem
0.21/0.57	# SZS output start CNFRefutation
0.21/0.57	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.21/0.57	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.21/0.57	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.21/0.57	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.21/0.57	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_non)).
0.21/0.57	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X396:$i]:(in @ X396 @ X1=>(X2 @ X396=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.21/0.57	thf(def_n_is, axiom, (n_is)=(^[X472:$i, X473:$i]:(X472)=(X473)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.21/0.57	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.21/0.57	thf(def_n_some, axiom, (n_some)=(^[X474:$i > $o]:(![X475:$i]:(in @ X475 @ nat=>(X474 @ X475=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.21/0.57	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)).
0.21/0.57	thf(def_l_ec, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_ec)).
0.21/0.57	thf(def_l_or, axiom, (l_or)=(^[X42:$o, X391:$o]:((X42=>~$true)=>X391)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_or)).
0.21/0.57	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X496:$i]:(in @ X496 @ nat=>((X1)=(n_pl @ X184 @ X496)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_d_29_ii)).
0.21/0.57	thf(def_d_and, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_and)).
0.21/0.57	thf(def_iii, axiom, (iii)=(^[X1:$i, X185:$i]:(![X499:$i]:(in @ X499 @ nat=>((X185)=(n_pl @ X1 @ X499)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_iii)).
0.21/0.57	thf(def_moreis, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X503:$i]:(in @ X503 @ nat=>((X1)=(n_pl @ X187 @ X503)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_moreis)).
0.21/0.57	thf(def_and3, axiom, (and3)=(^[X51:$o, X52:$o, X53:$o]:((X51=>(((X52=>(X53=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_and3)).
0.21/0.57	thf(satz10h, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X220:$i]:in @ X220 @ nat) @ (^[X221:$i]:(d_not @ (moreis @ X1 @ X221)<=iii @ X1 @ X221))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz10h)).
0.21/0.57	thf(def_ec3, axiom, (ec3)=(^[X54:$o, X55:$o, X56:$o]:(((X54=>(X55=>~$true))=>((((X55=>(X56=>~$true))=>((X56=>(X54=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_ec3)).
0.21/0.57	thf(def_lessis, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X504:$i]:(in @ X504 @ nat=>((X188)=(n_pl @ X1 @ X504)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_lessis)).
0.21/0.57	thf(satz9b, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X195:$i]:in @ X195 @ nat) @ (^[X196:$i]:ec3 @ (n_is @ X1 @ X196) @ (n_some @ (diffprop @ X1 @ X196)) @ (n_some @ (diffprop @ X196 @ X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz9b)).
0.21/0.57	thf(satz10d, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X235:$i]:in @ X235 @ nat) @ (^[X236:$i]:(d_not @ (d_29_ii @ X1 @ X236)<=lessis @ X1 @ X236))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz10d)).
0.21/0.57	thf(c_0_22, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.21/0.57	thf(c_0_23, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.21/0.57	thf(c_0_24, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_22])).
0.21/0.57	thf(c_0_25, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X396:$i]:(in @ X396 @ X1=>(X2 @ X396=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_23]), c_0_22]), c_0_24])).
0.21/0.57	thf(c_0_26, axiom, (n_is)=(^[X472:$i, X473:$i]:(X472)=(X473)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.21/0.57	thf(c_0_27, axiom, (n_some)=(^[X474:$i > $o]:(![X475:$i]:(in @ X475 @ nat=>(X474 @ X475=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_25])).
0.21/0.57	thf(c_0_28, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_26])).
0.21/0.57	thf(c_0_29, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_ec, def_imp]), c_0_22])).
0.21/0.57	thf(c_0_30, plain, ![X706:$i, X714:$i]:(epred18_2 @ X714 @ X706<=>~((((X706)=(X714)=>![X715:$i]:(in @ X715 @ nat=>(X706)!=(n_pl @ X714 @ X715)))=>((~(![X716:$i]:(in @ X716 @ nat=>(X706)!=(n_pl @ X714 @ X716)))=>![X717:$i]:(in @ X717 @ nat=>(X714)!=(n_pl @ X706 @ X717)))=>~((~(![X718:$i]:(in @ X718 @ nat=>(X714)!=(n_pl @ X706 @ X718)))=>(X706)!=(X714))))))), introduced(definition)).
0.21/0.57	thf(c_0_31, axiom, (l_or)=(^[X42:$o, X391:$o]:((X42=>~$true)=>X391)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_or, def_imp]), c_0_22])).
0.21/0.57	thf(c_0_32, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X496:$i]:(in @ X496 @ nat=>((X1)=(n_pl @ X184 @ X496)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_27]), c_0_28])).
0.21/0.57	thf(c_0_33, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_and, c_0_22]), c_0_29])).
0.21/0.57	thf(c_0_34, plain, ![X706:$i, X714:$i]:(epred18_2 @ X714 @ X706=>~((((X706)=(X714)=>![X715:$i]:(in @ X715 @ nat=>(X706)!=(n_pl @ X714 @ X715)))=>((~(![X716:$i]:(in @ X716 @ nat=>(X706)!=(n_pl @ X714 @ X716)))=>![X717:$i]:(in @ X717 @ nat=>(X714)!=(n_pl @ X706 @ X717)))=>~((~(![X718:$i]:(in @ X718 @ nat=>(X714)!=(n_pl @ X706 @ X718)))=>(X706)!=(X714))))))), inference(split_equiv,[status(thm)],[c_0_30])).
0.21/0.57	thf(c_0_35, axiom, (iii)=(^[X1:$i, X185:$i]:(![X499:$i]:(in @ X499 @ nat=>((X185)=(n_pl @ X1 @ X499)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_iii, c_0_27]), c_0_28])).
0.21/0.57	thf(c_0_36, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X503:$i]:(in @ X503 @ nat=>((X1)=(n_pl @ X187 @ X503)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_moreis, c_0_31]), c_0_26]), c_0_32])).
0.21/0.57	thf(c_0_37, axiom, (and3)=(^[X51:$o, X52:$o, X53:$o]:((X51=>(((X52=>(X53=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_and3, c_0_33])).
0.21/0.57	thf(c_0_38, plain, ![X1804:$i, X1805:$i, X1806:$i, X1807:$i, X1808:$i, X1809:$i]:(((X1804)!=(X1805)|(~in @ X1806 @ nat|(X1804)!=(n_pl @ X1805 @ X1806))|~epred18_2 @ X1805 @ X1804)&((~in @ X1807 @ nat|(X1804)!=(n_pl @ X1805 @ X1807)|(~in @ X1808 @ nat|(X1805)!=(n_pl @ X1804 @ X1808))|~epred18_2 @ X1805 @ X1804)&(~in @ X1809 @ nat|(X1805)!=(n_pl @ X1804 @ X1809)|(X1804)!=(X1805)|~epred18_2 @ X1805 @ X1804))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])).
0.21/0.57	thf(c_0_39, negated_conjecture, ~(![X920:$i]:(in @ X920 @ nat=>![X926:$i]:(in @ X926 @ nat=>(~(![X928:$i]:(in @ X928 @ nat=>(X926)!=(n_pl @ X920 @ X928)))=>~((![X927:$i]:(in @ X927 @ nat=>(X920)!=(n_pl @ X926 @ X927))=>(X920)=(X926))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz10h]), c_0_23]), c_0_22]), c_0_35]), c_0_36])])).
0.21/0.57	thf(c_0_40, axiom, (ec3)=(^[X54:$o, X55:$o, X56:$o]:(((X54=>(X55=>~$true))=>((((X55=>(X56=>~$true))=>((X56=>(X54=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_ec3, c_0_29]), c_0_37])).
0.21/0.57	thf(c_0_41, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X504:$i]:(in @ X504 @ nat=>((X188)=(n_pl @ X1 @ X504)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_lessis, c_0_31]), c_0_26]), c_0_35])).
0.21/0.57	thf(c_0_42, plain, ![X1:$i, X4:$i, X5:$i]:(~in @ X1 @ nat|(X4)!=(n_pl @ X5 @ X1)|(X5)!=(X4)|~epred18_2 @ X4 @ X5), inference(split_conjunct,[status(thm)],[c_0_38])).
0.21/0.57	thf(c_0_43, negated_conjecture, (in @ esk47_0 @ nat&(in @ esk48_0 @ nat&((in @ esk49_0 @ nat&(esk48_0)=(n_pl @ esk47_0 @ esk49_0))&((in @ esk50_0 @ nat|(esk47_0)=(esk48_0))&((esk47_0)=(n_pl @ esk48_0 @ esk50_0)|(esk47_0)=(esk48_0)))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])])).
0.21/0.57	thf(c_0_44, plain, ![X706:$i]:(in @ X706 @ nat=>![X714:$i]:(in @ X714 @ nat=>epred18_2 @ X714 @ X706)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz9b, c_0_23]), c_0_40]), c_0_26]), c_0_27]), c_0_28])]), c_0_30])).
0.21/0.57	thf(c_0_45, plain, ![X1083:$i]:(in @ X1083 @ nat=>![X1089:$i]:(in @ X1089 @ nat=>((![X1091:$i]:(in @ X1091 @ nat=>(X1089)!=(n_pl @ X1083 @ X1091))=>(X1083)=(X1089))=>![X1090:$i]:(in @ X1090 @ nat=>(X1083)!=(n_pl @ X1089 @ X1090))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz10d, c_0_23]), c_0_22]), c_0_32]), c_0_41])])).
0.21/0.57	thf(c_0_46, plain, ![X4:$i, X1:$i]:((n_pl @ X1 @ X4)!=(X1)|~in @ X4 @ nat|~epred18_2 @ X1 @ X1), inference(er,[status(thm)],[c_0_42])).
0.21/0.57	thf(c_0_47, negated_conjecture, (esk48_0)=(n_pl @ esk47_0 @ esk49_0), inference(split_conjunct,[status(thm)],[c_0_43])).
0.21/0.57	thf(c_0_48, negated_conjecture, in @ esk49_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_43])).
0.21/0.57	thf(c_0_49, plain, ![X1583:$i, X1584:$i]:(~in @ X1583 @ nat|(~in @ X1584 @ nat|epred18_2 @ X1584 @ X1583)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])])).
0.21/0.57	thf(c_0_50, plain, ![X1656:$i, X1657:$i, X1658:$i, X1659:$i]:((~in @ X1658 @ nat|(X1657)!=(n_pl @ X1656 @ X1658)|(~in @ X1659 @ nat|(X1656)!=(n_pl @ X1657 @ X1659))|~in @ X1657 @ nat|~in @ X1656 @ nat)&((X1656)!=(X1657)|(~in @ X1659 @ nat|(X1656)!=(n_pl @ X1657 @ X1659))|~in @ X1657 @ nat|~in @ X1656 @ nat)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])])).
0.21/0.57	thf(c_0_51, negated_conjecture, ((esk47_0)!=(esk48_0)|~epred18_2 @ esk47_0 @ esk47_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_48])])).
0.21/0.57	thf(c_0_52, plain, ![X1:$i, X4:$i]:(epred18_2 @ X4 @ X1|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_49])).
0.21/0.57	thf(c_0_53, negated_conjecture, in @ esk47_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_43])).
0.21/0.57	thf(c_0_54, plain, ![X1:$i, X4:$i, X6:$i, X5:$i]:(~in @ X1 @ nat|(X4)!=(n_pl @ X5 @ X1)|~in @ X6 @ nat|(X5)!=(n_pl @ X4 @ X6)|~in @ X4 @ nat|~in @ X5 @ nat), inference(split_conjunct,[status(thm)],[c_0_50])).
0.21/0.57	thf(c_0_55, negated_conjecture, ((esk47_0)=(n_pl @ esk48_0 @ esk50_0)|(esk47_0)=(esk48_0)), inference(split_conjunct,[status(thm)],[c_0_43])).
0.21/0.57	thf(c_0_56, negated_conjecture, (esk47_0)!=(esk48_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_53])])).
0.21/0.57	thf(c_0_57, negated_conjecture, (in @ esk50_0 @ nat|(esk47_0)=(esk48_0)), inference(split_conjunct,[status(thm)],[c_0_43])).
0.21/0.57	thf(c_0_58, plain, ![X1:$i, X4:$i, X5:$i]:((n_pl @ (n_pl @ X1 @ X4) @ X5)!=(X1)|~in @ (n_pl @ X1 @ X4) @ nat|~in @ X4 @ nat|~in @ X1 @ nat|~in @ X5 @ nat), inference(er,[status(thm)],[c_0_54])).
0.21/0.57	thf(c_0_59, negated_conjecture, (n_pl @ esk48_0 @ esk50_0)=(esk47_0), inference(sr,[status(thm)],[c_0_55, c_0_56])).
0.21/0.57	thf(c_0_60, negated_conjecture, in @ esk50_0 @ nat, inference(sr,[status(thm)],[c_0_57, c_0_56])).
0.21/0.57	thf(c_0_61, negated_conjecture, in @ esk48_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_43])).
0.21/0.57	thf(c_0_62, negated_conjecture, ![X1:$i]:((n_pl @ esk47_0 @ X1)!=(esk48_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_53]), c_0_60]), c_0_61])])).
0.21/0.57	thf(c_0_63, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62, c_0_47]), c_0_48])]), ['proof']).
0.21/0.57	# SZS output end CNFRefutation
0.21/0.57	# Proof object total steps             : 64
0.21/0.57	# Proof object clause steps            : 17
0.21/0.57	# Proof object formula steps           : 47
0.21/0.57	# Proof object conjectures             : 15
0.21/0.57	# Proof object clause conjectures      : 12
0.21/0.57	# Proof object formula conjectures     : 3
0.21/0.57	# Proof object initial clauses used    : 9
0.21/0.57	# Proof object initial formulas used   : 22
0.21/0.57	# Proof object generating inferences   : 5
0.21/0.57	# Proof object simplifying inferences  : 13
0.21/0.57	# Training examples: 0 positive, 0 negative
0.21/0.57	# Parsed axioms                        : 356
0.21/0.57	# Removed by relevancy pruning/SinE    : 0
0.21/0.57	# Initial clauses                      : 501
0.21/0.57	# Removed in clause preprocessing      : 153
0.21/0.57	# Initial clauses in saturation        : 348
0.21/0.57	# Processed clauses                    : 645
0.21/0.57	# ...of these trivial                  : 10
0.21/0.57	# ...subsumed                          : 128
0.21/0.57	# ...remaining for further processing  : 507
0.21/0.57	# Other redundant clauses eliminated   : 322
0.21/0.57	# Clauses deleted for lack of memory   : 0
0.21/0.57	# Backward-subsumed                    : 2
0.21/0.57	# Backward-rewritten                   : 11
0.21/0.57	# Generated clauses                    : 5701
0.21/0.57	# ...of the previous two non-trivial   : 5219
0.21/0.57	# Contextual simplify-reflections      : 3
0.21/0.57	# Paramodulations                      : 5125
0.21/0.57	# Factorizations                       : 0
0.21/0.57	# NegExts                              : 6
0.21/0.57	# Equation resolutions                 : 350
0.21/0.57	# Propositional unsat checks           : 0
0.21/0.57	#    Propositional check models        : 0
0.21/0.57	#    Propositional check unsatisfiable : 0
0.21/0.57	#    Propositional clauses             : 0
0.21/0.57	#    Propositional clauses after purity: 0
0.21/0.57	#    Propositional unsat core size     : 0
0.21/0.57	#    Propositional preprocessing time  : 0.000
0.21/0.57	#    Propositional encoding time       : 0.000
0.21/0.57	#    Propositional solver time         : 0.000
0.21/0.57	#    Success case prop preproc time    : 0.000
0.21/0.57	#    Success case prop encoding time   : 0.000
0.21/0.57	#    Success case prop solver time     : 0.000
0.21/0.57	# Current number of processed clauses  : 472
0.21/0.57	#    Positive orientable unit clauses  : 99
0.21/0.57	#    Positive unorientable unit clauses: 3
0.21/0.57	#    Negative unit clauses             : 55
0.21/0.57	#    Non-unit-clauses                  : 315
0.21/0.57	# Current number of unprocessed clauses: 4902
0.21/0.57	# ...number of literals in the above   : 19758
0.21/0.57	# Current number of archived formulas  : 0
0.21/0.57	# Current number of archived clauses   : 17
0.21/0.57	# Clause-clause subsumption calls (NU) : 22261
0.21/0.57	# Rec. Clause-clause subsumption calls : 6927
0.21/0.57	# Non-unit clause-clause subsumptions  : 82
0.21/0.57	# Unit Clause-clause subsumption calls : 7909
0.21/0.57	# Rewrite failures with RHS unbound    : 2
0.21/0.57	# BW rewrite match attempts            : 50
0.21/0.57	# BW rewrite match successes           : 8
0.21/0.57	# Condensation attempts                : 0
0.21/0.57	# Condensation successes               : 0
0.21/0.57	# Termbank termtop insertions          : 137760
0.21/0.58	
0.21/0.58	# -------------------------------------------------
0.21/0.58	# User time                : 0.202 s
0.21/0.58	# System time              : 0.017 s
0.21/0.58	# Total time               : 0.219 s
0.21/0.58	# Maximum resident set size: 2180 pages
0.21/0.58	EOF